On a class of quadratic polynomials with no zeros and its application to APN functions

نویسندگان

  • Carl Bracken
  • Chik How Tan
  • Yin Tan
چکیده

We show that the there exists an infinite family of APN functions of the form F (x) = x s +x k+s +2 k + cx k+s + c k x k +2 s + δx k , over F22k , where k is an even integer and gcd(2k, s) = 1, 3 ∤ k. This is actually a proposed APN family of Lilya Budaghyan and Claude Carlet who show in [6] that the function is APN when there exists c such that the polynomial y s+1+ cy s + c k y+1 = 0 has no solutions in the field F22k . In [6] they demonstrate by computer that such elements c can be found over many fields, particularly when the degree of the field is not divisible by 3. We show that such c exists when k is even and 3 ∤ k (and demonstrate why the k odd case only re-describes an existing family of APN functions). The form of these coefficients is given so that we may write the infinite family of APN functions. APN functions; zeros of polynomials; irreducible polynomials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Fourier Spectra of New APN Functions

Almost perfect nonlinear (APN) functions on F2n are functions achieving the lowest possible differential uniformity. All APN functions discovered until now are either power or quadratic ones, except for one sporadic multinomial nonquadratic example on F26 due to Edel and Pott. It is well known that certain binary codes with good properties can be obtained from APN functions, and determining the...

متن کامل

Quadratic Binomial APN Functions and Absolutely Irreducible Polynomials

We show that many quadratic binomial functions of the form cx i +2 j + dx u +2 v (c, d ∈ GF (2m)) are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses the Weil bound from algebraic geometry.

متن کامل

The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions

The first APN polynomials EA-inequivalent to power functions have been constructed in [7, 8] by applying CCZ-equivalence to the Gold APN functions. It is a natural question whether it is possible to construct APN polynomials EA-inequivalent to power functions by using only EA-equivalence and inverse transformation on a power APN function: this would be the simplest method to construct APN polyn...

متن کامل

Some compact generalization of inequalities for polynomials with prescribed zeros

‎Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial‎ ‎of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$‎. ‎In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$‎, ‎$k^2 leq rRleq R^2$ and for $Rleq r leq k$‎. ‎Our results refine and generalize certain well-known polynomial inequalities‎.

متن کامل

Using Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions

Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2014